Co-Clustering for Multitask Learning
نویسندگان
چکیده
This paper presents a new multitask learning framework that learns a shared representation among the tasks, incorporating both task and feature clusters. The jointlyinduced clusters yield a shared latent subspace where task relationships are learned more effectively and more generally than in state-of-the-art multitask learning methods. The proposed general framework enables the derivation of more specific or restricted stateof-the-art multitask methods. The paper also proposes a highly-scalable multitask learning algorithm, based on the new framework, using conjugate gradient descent and generalized Sylvester equations. Experimental results on synthetic and benchmark datasets show that the proposed method systematically outperforms several state-of-the-art multitask learning methods.
منابع مشابه
An Enhanced Spectral Clustering for Overlapping Data in Multiple Task Clustering
Clustering is one of the most widely used approaches for exploratory data analysis in data mining. In large scale data sources, multitask clustering is an important research work to handle overlapping data, negative and non-negative values among clustering of multiple tasks which is used to improve the learning relationship among related tasks and sharing of information across the tasks. Recent...
متن کاملCMPS 290c S07: Final Project: MCMC Algorithms for solving Multitask Co-Leraning Problem
This project presents the di¢ culties in bounding the mixing time of the Markov chain presented in [1] for solving the multitask co-learning problem. In particular I show why the technics of canonical paths and coupling can not be directly applied. Then I propose an alternative markov chain that approximate the notion of co-learning for which a bounding in the mixing time is possible. The upper...
متن کاملBasics Sequential Algorithmic Scheme Clustering by Exploring Inter and Intra Task Co-relations
Clustering, as one of the most classical research problems in pattern recognition and data mining, has been widely explored and applied to various applications. Due to the rapid evolution of data on the Web, more emerging challenges have been posed on traditional clustering techniques: 1) correlations among related clustering tasks and/or within individual task are not well captured; 2) the pro...
متن کاملRegularized Multitask Learning for Multidimensional Log-Density Gradient Estimation
Log-density gradient estimation is a fundamental statistical problem and possesses various practical applications such as clustering and measuring nongaussianity. A naive two-step approach of first estimating the density and then taking its log gradient is unreliable because an accurate density estimate does not necessarily lead to an accurate log-density gradient estimate. To cope with this pr...
متن کاملLinear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. We formalize task relatedness in different ways, and derive formal guarantees on the performance advantage provided by interaction. Our online analysis gives new stimulating insights into previously known co-regularizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1703.00994 شماره
صفحات -
تاریخ انتشار 2017